Generating Functions for Permutations which Contain a Given Descent Set
نویسندگان
چکیده
A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation σ, des(σ), arise in this way. For any given finite set S of positive integers, we develop a method to produce similar generating functions for the set of permutations of the symmetric group Sn whose descent set contains S. Our method will be to apply certain homomorphisms to symmetric function identities involving ribbon Schur functions.
منابع مشابه
Descent Patterns in Permutations
We consider the problem of finding generating functions for permutations which contain a given descent set. We expand on recent work of Remmel and Riehl, who developed a systematic way to find generating functions for permutations which contain a given finite descent set S, by showing that in many cases we can find generating functions for permutations σ in the symmetric group Sn whose descent ...
متن کاملCounting Permutations with Given Cycle Structure and Descent Set
The purpose of this paper is to count permutations in S , with a given cycle structure and a given descent set. Our main result (Theorem 2.1) asserts that the number of these permutations can be expressed as a scalar product of two symmetric functions, one associated with the cycle structure and the other with the descent set. Both of these symmetric functions can be interpreted as characterist...
متن کاملDescent polynomials for permutations with bounded drop size
Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, . . . , n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive the related generating functions and prove unimodality and symmetry of the coefficients. Résumé. Motivés par les “suites de jonglerie” et le tri à bull...
متن کاملEfficient generating algorithm for permutations with a fixed number of excedances
In this paper, we develop a constant amortized time (CAT) algorithm for generating permutations with a fixed number of excedances. We obtain a Gray code for permutations having one excedance. We also give a bijection between the set of n-length permutations with exactly one excedance and the set Sn(321, 2413, 3412, 21534)\{123 . . . (n− 1)n}. This induces a Gray code for the set Sn(321, 2413, 3...
متن کاملThe pure descent statistic on permutations
We introduce a new statistic based on permutation descents which has a distribution given by the Stirling numbers of the first kind, i.e., with the same distribution as for the number of cycles in permutations. We study this statistic on the sets of permutations avoiding one pattern of length three by giving bivariate generating functions. As a consequence, new classes of permutations enumerate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010